多模块ROP碎片化自动布局方法

返回导向式编程(Return Oriented Programming, ROP)是一种可有效绕过数据执行保护机制的技术。ROP通过搜索内存代码区中合适的汇编指令片段,可组成一段执行特定功能的程序。已有的ROP自动构造技术只考虑ROP链的功能实现,而忽视了ROP链布局对程序内存可控性的要求,导致自动生成的ROP链实用性低。为解决该问题,提出了一种基于符号执行的多模块ROP碎片化自动布局方法。该方法在ROP自动构造Q框架的基础上,以模块为单位对ROP链进行切片;使用符号执行工具S2E,对控制流劫持状态下的程序内存状态进行动态分析;为各ROP模块匹配相应的可控内存区域,构造碎片化布局的ROP链。实验证明,相比已有技术,该方法生成的ROP链有效降低了对程序内存可控性的要求。     

用于三维点云表示的扩展点特征直方图算法

局部特征提取在点云相关应用中具有十分重要的作用,因此提出一种用于点云局部特征表示的扩展点特征直方图描述子。针对邻域点的两两点对提出一系列不变量;在特征点上构建一个局部参考坐标框架以获得特征描述子对旋转和平移的不变性;将关键点局部邻域划分成多个子空间,并依据每个子空间中的点对不变量构建一个直方图;将所有直方图串联起来得到扩展点特征直方图特征描述子。采用Bologna公共数据集对扩展点特征直方图特征描述子的性能进行测试,并与多个现有算法进行对比。结果表明,扩展点特征直方图特征描述子获得了良好的性能,其结果优于多个现有的特征描述子。     

空袭中预警机阵位选择及航线规划

针对空袭作战时对预警机的需求问题,以空袭作战想定为背景,构建了预警机阵位选择的估算模型;以预警机实时探测能力为基础,给出了预警机航线规划的定量公式,并在其中考虑了工作模式变化对其影响;通过仿真,分析了主要参数与预警机阵位和航线的关系,其结果具有一定的实用价值。     

基于改进遗传算法的反舰导弹航路规划模型研究

针对传统遗传算法在进行复杂的大范围优化问题时容易陷入局部最优和收敛速度慢的局限,提出采用基于混沌的遗传算法进行反舰导弹航路优化问题的求解。在遗传算法操作时加入混沌操作,扩大了搜索范围,提高了优化速度,有效地解决了解空间巨大带来遗传算法的上述局限性。     

Balancing a one‐way corridor capacity and safety‐oriented reliability: A stochastic optimization approach for metro train timetabling

In urban rail transit systems of large cities, the headway and following distance of successive trains have been compressed as much as possible to enhance the corridor capacity to satisfy extremely high passenger demand during peak hours. To prevent train collisions and ensure the safety of trains, a safe following distance of trains must be maintained. However, this requirement is subject to a series of complex factors, such as the uncertain train braking performance, train communication delay, and driver reaction time. In this paper, we propose a unified mathematical framework to analyze the safety‐oriented reliability of metro train timetables with different corridor capacities, that is, the train traffic density, and determine the most reliable train timetable for metro lines in an uncertain environment. By employing a space‐time network representation in the formulations, the reliability‐based train timetabling problem is formulated as a nonlinear stochastic programming model, in which we use 0‐1 variables to denote the time‐dependent velocity and position of all involved trains. Several reformulation techniques are developed to obtain an equivalent mixed integer programming model with quadratic constraints (MIQCP) that can be solved to optimality by some commercial solvers. To improve the computational efficiency of the MIQCP model, we develop a dual decomposition solution framework that decomposes the primal problem into several sets of subproblems by dualizing the coupling constraints across different samples. An exact dynamic programming combined with search space reduction strategies is also developed to solve the exact optimal solutions of these subproblems. Two sets of numerical experiments, which involve a relatively small‐scale case and a real‐world instance based on the operation data of the Beijing subway Changping Line are implemented to verify the effectiveness of the proposed approaches.     

一致光滑Banach空间中一类非线性算子方程的解

证明了一个新的锐角原理,在不使用连续性条件的情况下,给出了在一致光滑Banach空间中一类非线性算子方程的可解性定理。     

Coordination of pricing and inventory control across products

We consider the joint pricing and inventory‐control problem for a retailer who orders, stocks, and sells two products. Cross‐price effects exist between the two products, which means that the demand of each product depends on the prices of both products. We derive the optimal pricing and inventory‐control policy and show that this policy differs from the base‐stock list‐price policy, which is optimal for the one‐product problem. We find that the retailer can significantly improve profits by managing the two products jointly as opposed to independently, especially when the cross‐price demand elasticity is high. We also find that the retailer can considerably improve profits by using dynamic pricing as opposed to static pricing, especially when the demand is nonstationary. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Production planning with resources subject to congestion

A fundamental difficulty in developing effective production planning models has been accurately reflecting the nonlinear dependency between workload and lead times. We develop a mathematical programming model for production planning in multiproduct, single stage systems that captures the nonlinear dependency between workload and lead times. We then use outer linearization of this nonlinear model to obtain a linear programming formulation and extend it to multistage systems. Extensive computational experiments validate the approach and compare its results to conventional models that assume workload‐independent planning lead times. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

论火灾调查中对起火部位和起火点的认定

火灾事故调查是公安消防工作中一项专业性很强的业务工作。准确认定起火部位、起火点在火灾事故调查中极其重要。通过分析影响认定起火部位、起火点的因素，得出了6种判定起火部位、起火点的基本方法。     

基于A*算法的坦克CGF全局路径规划

提出了一种应用A*启发式搜索算法对虚拟战场中坦克CGF(Computer Generated Forces)实体进行全局路径规划的方法,同时对A*算法进行了改进,利用二叉堆的结构组织OPEN表,大大加速了A*算法的搜索效率。所提方法可以处理较大规模的战场地形,具有较高的效率。